Heuristic Methods for Security Protocols
نویسندگان
چکیده
Model checking is an automatic verification technique to verify hardware and software systems. However it suffers from state-space explosion problem. In this paper we address this problem in the context of cryptographic protocols by proposing a security property-dependent heuristic. The heuristic weights the state space by exploiting the security formulae; the weights may then be used to explore the state space when searching for attacks.
منابع مشابه
A Search-Based Framework for Security Protocol Synthesis
Security protocol verification has been the area where the bulk of the research in cryptographic protocols has taken place and a number of successful supporting tools have been developed. However, not much research has been done in the area of applying formal methods to the design of cryptographic protocols in the first place, despite wide recognition that the design of cryptographic protocols ...
متن کاملTripartite Authenticated Key Agreement Protocols from Pairings
Joux’s protocol [29] is a one round, tripartite key agreement protocol that is more bandwidth-efficient than any previous three-party key agreement protocol. But it is insecure, suffering from a simple man-inthe-middle attack. This paper shows how to make Joux’s protocol secure, presenting several tripartite, authenticated key agreement protocols that still require only one round of communicati...
متن کاملThe Provably Secure Formal Methods for Authentication and Key Agreement Protocols
In the design and analysis of authentication and key agreement protocols, provably secure formal methods play a very important role, among which the Canetti-Krawczyk (CK) model and universal composable (UC) security model are very popular at present. This chapter focuses on these two models and consists mainly of three parts: (1) an introduction to CK model and UC models; (2) A study of these t...
متن کاملOn the Algorithms Related to Threshold Cryptography Based Network Protocols
In this paper we analyzed the algorithms related to threshold cryptography based protocols in networks security. We showed the hardness of threshold minimum cut problem, revealed its relationship with two other problems. Two approximation algorithms for threshold minimum cut were presented. We also show the hardness of determining the probability of threshold access to service nodes in a node-b...
متن کاملSecurity-Focused Survey on Group Key Exchange Protocols
In this paper we overview a large number of currently known group key exchange protocols while focusing on the protocols designed for more than three participants (for an overview of twoand three-party key exchange protocols we refer to [BM03, DB05c]). For each mentioned protocol we briefly describe the current state of security based on the original analysis as well as later results appeared i...
متن کامل